Implementing the Merge Sort Algorithm in C++

Merge sort is based on the divide-and-conquer principle, with the core being "divide-merge": first recursively split the array into individual elements (where subarrays are ordered), then merge two ordered subarrays into a larger ordered array. **Divide process**: Recursively split the array from the middle until each subarray contains only one element. **Merge process**: Compare elements from two ordered subarrays, take the smaller value and place it in the result array sequentially, then handle the remaining elements. The C++ implementation includes two core functions: `mergeSort` for recursively dividing the array, and `merge` for merging two ordered subarrays. The time complexity is O(n log n), and the space complexity is O(n) (due to the need for a temporary array). Merge sort is stable and efficient, making it suitable for sorting large-scale data. In the example, the array `[5,3,8,6,2,7,1,4]` is sorted into the ordered array `[1,2,3,4,5,6,7,8]` through division and merging, verifying the algorithm's correctness.